Distributed Change Detection Based on a Consensus Algorithm
نویسندگان
چکیده
منابع مشابه
Entropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملA non-consensus based distributed optimization algorithm
In this paper we introduce a discrete-time, distributed optimization algorithm executed by a set of agents whose interactions are subject to a communication graph. The algorithm can be applied to optimization costs that are expressed as sums of functions, where each function is associated to an agent. The algorithm can be applied to continuously differentiable cost functions, it is not consensu...
متن کاملMulti-UAV Distributed Cooperative Detection Based on Consensus
This paper presents an analysis method aiming at UAV cooperative detection problem. The UAV detect the target and establish the state information respectively, and send the message to the adjacent friendly aircraft. The friendly aircraft judge if there are repetition between their own information and the message they have received after they receive the message, and re-order the target till the...
متن کاملDistributed Path Consensus Algorithm
Path planning methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...
متن کاملA Distance-based Kernel Change Detection Algorithm
This paper proposes a distance-based kernel change detection algorithm (DKCD). The input vectors from two images of different times are mapped into a potentially much higher dimensional feature space via a nonlinear mapping. Which will usually increase the linear separation of change and no-change regions. Then, a simple linear distance measure between two feature vectors of high dimension is d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2010
ISSN: 1474-6670
DOI: 10.3182/20100913-2-fr-4014.00050